finite-length arithmetic

См. также в других словарях:

• Arithmetic — tables for children, Lausanne, 1835 Arithmetic or arithmetics (from the Greek word ἀριθμός, arithmos “number”) is the oldest and most elementary branch of mathematics, used b …   Wikipedia

• Arithmetic coding — is a method for lossless data compression. Normally, a string of characters such as the words hello there is represented using a fixed number of bits per character, as in the ASCII code. Like Huffman coding, arithmetic coding is a form of… …   Wikipedia

• arithmetic — arithmetically, adv. n. /euh rith meuh tik/; adj. /ar ith met ik/, n. 1. the method or process of computation with figures: the most elementary branch of mathematics. 2. Also called higher arithmetic, theoretical arithmetic. the theory of… …   Universalium

• Variable-length code — In coding theory a variable length code is a code which maps source symbols to a variable number of bits. Variable length codes can allow sources to be compressed and decompressed with zero error (lossless data compression) and still be read back …   Wikipedia

• Primes in arithmetic progression — In number theory, the phrase primes in arithmetic progression refers to at least three prime numbers that are consecutive terms in an arithmetic progression, for example the primes (3, 7, 11) (it does not matter that 5 is also prime). There are… …   Wikipedia

• Problems involving arithmetic progressions — are of interest in number theory,cite journal|author=Samuel S. Wagstaff, Jr.|authorlink= url= title=Some Questions About Arithmetic Progressions journal=The American Mathematical Monthly volume=86|issue=7|pages=579–582|year=1979… …   Wikipedia

• Presburger arithmetic — is the first order theory of the natural numbers with addition, named in honor of Mojżesz Presburger, who published it in 1929. It is not as powerful as Peano arithmetic because it omits multiplication.OverviewThe language of Presburger… …   Wikipedia

• Inequality of arithmetic and geometric means — In mathematics, the inequality of arithmetic and geometric means, or more briefly the AM GM inequality, states that the arithmetic mean of a list of non negative real numbers is greater than or equal to the geometric mean of the same list; and… …   Wikipedia

• Minimum description length — The minimum description length (MDL) principle is a formalization of Occam s Razor in which the best hypothesis for a given set of data is the one that leads to the best compression of the data. MDL was introduced by Jorma Rissanen in 1978. It is …   Wikipedia

• арифметика конечной точности — — [http://www.iks media.ru/glossary/index.html?glossid=2400324] Тематики электросвязь, основные понятия EN finite length arithmetic …   Справочник технического переводчика

• Mathematics and Physical Sciences — ▪ 2003 Introduction Mathematics       Mathematics in 2002 was marked by two discoveries in number theory. The first may have practical implications; the second satisfied a 150 year old curiosity.       Computer scientist Manindra Agrawal of the… …   Universalium